Investigating efficient methods for computing four-quark correlation functions

نویسندگان

  • Abdou Abdel-Rehim
  • Constantia Alexandrou
  • Joshua Berlin
  • Mattia Dalla Brida
  • Jacob Finkenrath
  • Marc Wagner
چکیده

We discuss and compare the efficiency of various methods, combinations of point-to-all propagators, stochastic timeslice-to-all propagators, the one-end trick and sequential propagators, to compute two-point correlation functions of two-quark and four-quark interpolating operators of different structure including quark-antiquark type, mesonic molecule type, diquark-antidiquark type and two-meson type. Although we illustrate our methods in the context of the a0(980), they can be applied for other multi-quark systems, where similar diagrams appear. Thus our results could provide helpful guidelines on the choice of methods for correlation function computation for future lattice QCD studies of meson-meson scattering and possibly existing tetraquark states. ar X iv :1 70 1. 07 22 8v 1 [ he pla t] 2 5 Ja n 20 17

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient computation of meson and four-quark correlation functions

This work deals with the efficiency of different methods for computing correlation functions of bound states in twisted mass lattice QCD with Nf = 2 flavors of seaquarks. In particular, the focus will be on pseudo-scalar and scalar meson correlators as well as correlation functions generated by a four-quark operator. The main part of this thesis will be the comparison of three methods used to c...

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

Evolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol

The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Physics Communications

دوره 220  شماره 

صفحات  -

تاریخ انتشار 2017